Dynamic Tardos Traitor Tracing Schemes

We construct binary dynamic traitor tracing schemes, where the number of watermark bits needed to trace and disconnect any coalition of pirates is quadratic in the number of pirates, and logarithmic in the total number of users and the error probability. Our results improve upon results of Tassa, and our schemes have several other advantages, such as being able to generate all codewords in advance, a simple accusation method, and flexibility when the feedback from the pirate network is delayed.Comment: 13 pages, 5 figure

Combined exome and whole-genome sequencing identifies mutations in ARMC4 as a cause of primary ciliary dyskinesia with defects in the outer dynein arm

Primary ciliary dyskinesia (PCD) is a rare, genetically heterogeneous ciliopathy disorder affecting cilia and sperm motility. A range of ultrastructural defects of the axoneme underlie the disease, which is characterised by chronic respiratory symptoms and obstructive lung disease, infertility and body axis laterality defects. We applied a next-generation sequencing approach to identify the gene responsible for this phenotype in two consanguineous families

A Detailed Analysis of the Murine TAP Transporter Substrate Specificity

The transporter associated with antigen processing (TAP) supplies cytosolic peptides into the endoplasmic reticulum for binding to major histocompatibility complex (MHC) class I molecules. Its specificity therefore influences the repertoire of peptides presented by MHC molecules. Compared to human TAP, murine TAP's binding specificity has not been characterized as well, even though murine systems are widely used for basic studies of antigen processing and presentation.We performed a detailed experimental analysis of murine TAP binding specificity by measuring the binding affinities of 323 peptides. Based on this experimental data, a computational model of murine TAP specificity was constructed. The model was compared to previously generated data on human and murine TAP specificities. In addition, the murine TAP specificities for known epitopes and random peptides were predicted and compared to assess the impact of murine TAP selectivity on epitope selection.Comparisons to a previously constructed model of human TAP specificity confirms the well-established differences for peptide substrates with positively charged C-termini. In addition these comparisons show that several residues at the N-terminus of peptides which strongly influence binding to human TAP showed little effect on binding to murine TAP, and that the overall influence of the aminoterminal residues on peptide affinity for murine TAP is much lower than for the human transporter. Murine TAP also partly prefers different hydrophobic amino acids than human TAP in the carboxyterminal position. These species-dependent differences in specificity determined in vitro are shown to correlate with the epitope repertoire recognized in vivo. The quantitative model of binding specificity of murine TAP developed herein should be useful for interpreting epitope mapping and immunogenicity data obtained in humanized mouse models

Factoring high-degree polynomials over F2 with Niederreiter’s algorithm on

Abstract. A C implementation of Niederreiter’s algorithm for factoring polynomials over F2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain system of linear equations, is performed in parallel. Once a basis for the solution space is found, all irreducible factors of the polynomial can be extracted by suitable gcdcomputations. For this purpose, asymptotically fast polynomial arithmetic algorithms are implemented. These include Karatsuba & Ofman multiplication, Cantor multiplication and Newton inversion. In addition, a new efficient version of the half-gcd algorithm is presented. Sequential run times for the polynomial arithmetic and parallel run times for the factorization are given. A new “world record ” for polynomial factorization over the binary field is set by showing that a pseudo-randomly selected polynomial of degree 300000 can be factored in about 10 hours on 256 nodes of the IBM SP2 at the Cornell Theory Center. 1

Comparative Implementations of Berlekamp's and Niederreiter's Polynomial Factorization Algorithms

New C++ -implementations of the classical factorization algorithms for polynomials over finite fields of Berlekamp and the new ones of Niederreiter are presented. Their performances on various types of inputs are compared

The Black-Box Niederreiter Algorithm and its Implementation Over the Binary Field

The most time-consuming part of the Niederreiter algorithm for factoring univariate polynomials over finite fields is the computation of elements of the nullspace of a certain matrix. This paper describes the so-called "black-box" Niederreiter algorithm, in which these elements are found by using a method developed by Wiedemann. The main advantages over an approach based on Gaussian elimination are that the matrix does not have to be stored in memory and that the computational complexity of this approach is lower. The black-box Niederreiter algorithm for factoring polynomials over the binary field was implemented in the C programming language, and benchmarks for factoring high-degree polynomials over this field are presented. These benchmarks include timings for both a sequential implementation and a parallel implementation running on a small cluster of workstations. In addition, the Wan algorithm, which was recently introduced, is described, and connections between (implementation aspects of) Wan's and Niederreiter's algorithm are given